package 数组;

public class 长度最小的子数组 {
    class Solution{
        public int minSubArrayLen(int s,int[] nums){
               int left = 0;
               int sum = 0;
               int result = Integer.MAX_VALUE;
            for (int right = 0; right < nums.length; right++) {
                sum+=nums[right];
                if (sum>=s){
                    result = Math.min(result,right-left+1);
                    sum-=nums[left++];
                }
            }
              return result==Integer.MAX_VALUE?0:result;
        }
    }
}
